Linearly unrelated sequences
نویسندگان
چکیده
منابع مشابه
Linearly Unrelated Sequences
There are not many new results concerning the linear independence of numbers. Exceptions in the last decade are, e.g., the result of Sorokin [8] which proves the linear independence of logarithmus of special rational numbers, or that of Bezivin [2] which proves linear independence of roots of special functional equations. The algebraic independence of numbers can be considered as a generalizati...
متن کاملSecure Linear Algebra Using Linearly Recurrent Sequences
In this work we present secure two-party protocols for various core problems in linear algebra. Our main result is a protocol to obliviously decide singularity of an encrypted matrix: Bob holds an n×n matrix, encrypted with Alice’s secret key, and wants to learn whether or not the matrix is singular (while leaking nothing further). We give an interactive protocol between Alice and Bob that solv...
متن کاملGlobally, unrelated protein sequences appear random
MOTIVATION To test whether protein folding constraints and secondary structure sequence preferences significantly reduce the space of amino acid words in proteins, we compared the frequencies of four- and five-amino acid word clumps (independent words) in proteins to the frequencies predicted by four random sequence models. RESULTS While the human proteome has many overrepresented word clumps...
متن کاملDesign of Cryptographically Strong Generator By Transforming Linearly Generated Sequences
Random numbers have been used extensively in many simulation applications like Monte Carlo Integration or computer modeling. But recently security applications have increased the need for strong (secure) random number generation like automatic password generation, encryption algorithms, on-line gambling etc. Thus random number generation has become a challenging and an interesting task. Most cl...
متن کاملFast (Multi-)Evaluation of Linearly Recurrent Sequences: Improvements and Applications
For a linearly recurrent sequence P n+1 = A(n)·P n, consider the problem of calculating either the n-th term P n or l ≤ n arbitrary terms P n1 , . . .P nl , both for the case of constant coefficients A(n) ≡ A and for a matrix A(N) with entries polynomial in N . We improve and extend known algorithms for this problem and present new applications for it. Specifically it turns out that for instanc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 1999
ISSN: 0030-8730
DOI: 10.2140/pjm.1999.190.299